FICA: Fast Incremental Clustering Algorithm
نویسندگان
چکیده
منابع مشابه
A Fast Incremental Clustering Algorithm
Clustering has played a very important role in data mining. In this paper, a fast incremental clustering algorithm is proposed by changing the radius threshold value dynamically. The algorithm restricts the number of the final clusters and reads the original dataset only once. At the same time an inter-cluster dissimilarity measure taking into account the frequency information of the attribute ...
متن کاملFast Incremental Minimum-Cut Based Algorithm for Graph Clustering
In this paper we introduce an incremental clustering algorithm for undirected graphs. The algorithm can maintain clusters efficiently in presence of insertion and deletion (updation) of edges and vertices. The algorithm produces clusters that satisfies the quality requirement, given by the bicriteria of [6]. To the best of our knowledge, this is the first clustering algorithm, for dynamic graph...
متن کاملAn Incremental DC Algorithm for the Minimum Sum-of-Squares Clustering
Here, an algorithm is presented for solving the minimum sum-of-squares clustering problems using their difference of convex representations. The proposed algorithm is based on an incremental approach and applies the well known DC algorithm at each iteration. The proposed algorithm is tested and compared with other clustering algorithms using large real world data sets.
متن کاملAn “Incremental” Clustering Algorithm for Coreference Resolution
Coreference resolution, also known as the process of linking noun phrases (NPs) referring to the same real world entity mentioned in a document, is a difficult and important task in natural language processing. This paper introduces an “incremental” unsupervised coreference resolution algorithm that can make the most of the transitive property in a coreference chain as well as the dependencies ...
متن کاملA Fast Fuzzy Clustering Algorithm
Clustering algorithms have been utilized in a wide variety of application areas. One of these algorithms is the Fuzzy C-Means algorithm (FCM). One of the problems with these algorithms is the time needed to converge. In this paper, a Fast Fuzzy C-Means algorithm (FFCM) is proposed based on experimentations, for improving fuzzy clustering. The algorithm is based on decreasing the number of dista...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2018
ISSN: 0975-8887
DOI: 10.5120/ijca2018916747